منابع مشابه
Time-Space Tradeoffs for Set Operations
This paper considers time-space tradeoos for various set operations. Denoting the time requirement of an algorithm by T and its space requirement by S, it is shown that T S = (n 2) for set complementation and T S = ? n 3=2 for set intersection, in the R-way branching program model. In the more restricted model of comparison branching programs, the paper provides two additional types of results....
متن کاملTime-Space Tradeoffs for Satisfiability
We give the first nontrivial model-independent time-space tradeoffs for satisfiability. Namely, we show that SAT cannot be solved simultaneously in n time and n1− space for any > 0 on general random-access nondeterministic Turing machines. In particular, SAT cannot be solved deterministically by a Turing machine using quasilinear time and √ n space. We also give lower bounds for log-space unifo...
متن کاملSpace-Time Tradeoffs for Emptiness Queries
We develop the rst nontrivial lower bounds on the complexity of online hyperplane and halfspace emptiness queries. Our lower bounds apply to a general class of geometric range query data structures called partition graphs. Informally, a partition graph is a directed acyclic graph that describes a recursive decomposition of space. We show that any partition graph that supports hyperplane emptine...
متن کاملTime-Space Tradeoffs for the Memory Game
A single-player game of MEMORY is played with n distinct pairs of cards, with the cards in each pair bearing identical pictures. The cards are laid face-down. A move consists of revealing two cards, chosen adaptively. If these cards match, i.e., they bear the same picture, they are removed from play; otherwise, they are turned back to face down. The object of the game is to clear all cards whil...
متن کاملSpace-Time Tradeoffs for Distributed Verification
Verifying that a network configuration satisfies a given boolean predicate is a fundamental problem in distributed computing. Many variations of this problem have been studied, for example, in the context of proof labeling schemes (PLS), locally checkable proofs (LCP), and non-deterministic local decision (NLD). In all of these contexts, verification time is assumed to be constant. Korman, Kutt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1993
ISSN: 0304-3975
DOI: 10.1016/0304-3975(93)90352-t